Multidimensional projection filters via automatic differentiation and sparse-grid integration
نویسندگان
چکیده
• We use automatic differentiation and sparse-grid integration to automate the construction of projection filter. present methods for constructing filters multidimensional filtering problems using a non-Gaussian parametric density. show that practical performance filter is comparable particle finite difference based solutions Kushner–Stratonovich equation. An open-source implementation method available. The technique approximating optimal problems. In filters, stochastic partial differential equation governs propagation density projected manifold densities, resulting in finite-dimensional Despite fact are capable representing complicated probability their current implementations limited Gaussian family or unidimensional applications. This work considers combination numerical construct algorithms more generic Specifically, we provide detailed exposition this exponential family, how apply cases. demonstrate numerically on comparison finite-difference solution bootstrap with systematic resampling, proposed algorithm retains an accurate approximation while requiring comparatively low number quadrature points. Due used calculate expected values natural statistics Fisher metric, highly scalable. They therefore suitable many applications which dimensions exceeds limit but where Gaussian-approximations deemed unsatisfactory.
منابع مشابه
Sparse Principal Component Analysis via Variable Projection
Sparse principal component analysis (SPCA) has emerged as a powerful technique for modern data analysis. We discuss a robust and scalable algorithm for computing sparse principal component analysis. Specifically, we model SPCA as a matrix factorization problem with orthogonality constraints, and develop specialized optimization algorithms that partially minimize a subset of the variables (varia...
متن کاملAccelerated Sparse Linear Regression via Random Projection
In this paper, we present an accelerated numerical method based on random projection for sparse linear regression. Previous studies have shown that under appropriate conditions, gradient-based methods enjoy a geometric convergence rate when applied to this problem. However, the time complexity of evaluating the gradient is as large as O(nd), where n is the number of data points and d is the dim...
متن کاملParametric Manifold Learning Via Sparse Multidimensional Scaling
We propose a metric-learning framework for computing distance-preserving maps that generate low-dimensional embeddings for a certain class of manifolds. We employ Siamese networks to solve the problem of least squares multidimensional scaling for generating mappings that preserve geodesic distances on the manifold. In contrast to previous parametric manifold learning methods we show a substanti...
متن کاملAutomatic differentiation of ODE integration
3 Example: Differentiating the Lotka-Volterra ODE system 2 3.1 The Lotka-Volterra ODE system . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 3.2 The derivatives of the Lotka-Volterra ODE system . . . . . . . . . . . . . . . . . . 3 3.3 Integration of the original and augmented Lotka-Volterra ODE system with the Runge-Kutta method . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
متن کاملFace Image Superresolution via Locality Preserving Projection and Sparse Coding
It is important to enhance the resolution of face images from video surveillance for recognization and other post processing. In this paper, a novel sparse representation based face image superresolution (SR) method is proposed to reconstruct a high resolution (HR) face image from a LR observation. First, it gets a HR-LR dictionary pair for certain input LR patch via position patch clustering a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2023
ISSN: ['0165-1684', '1872-7557']
DOI: https://doi.org/10.1016/j.sigpro.2022.108832